Solving dynamic contact problems with local refinement in space and time
نویسندگان
چکیده
منابع مشابه
Space-Time Finite Element Methods for Dynamic Frictional Contact Problems
Space-time finite element methods for dynamic frictional contact problems are discussed in this article. The discretization scheme is based on a mixed formulation of the continuous problem, where the Lagrange multipliers represent the contact and frictional stresses. Using piecewise d-linear and globally continuous basis functions in space and time to construct the trial space for the displacem...
متن کاملNearwell local space and time refinement in reservoir simulation
Abstract. In reservoir simulations, nearwell regions usually require finer space and time scales compared with the remaining of the reservoir domain. We present a domain decomposition algorithm for a two phase Darcy flow model coupling nearwell regions locally refined in space and time with a coarser reservoir discretization. The algorithm is based on an optimized Schwarz method using a full ov...
متن کاملOn Solving Quickest Time Problems in Time-Dependent, Dynamic Networks
In this paper, a pseudopolynomial time algorithm is presented for solving the integral time-dependent quickest flow problem (TDQFP) and its multiple source and sink counterparts: the time-dependent evacuation and quickest transshipment problems. A more widely known, though less general version, is the quickest flow problem (QFP). The QFP has historically been defined on a dynamic network, where...
متن کاملSolving Frictional Contact Problems with Multigrid Efficiency
The construction of fast and reliable solvers for contact problems with friction is even nowadays a challenging task. It is well known that contact problems with Coulomb friction have the weak form of a quasi-variational inequality [KO88, HHNL88, NJH80]. For small coefficients of friction, a solution can be obtained by means of a fixed point iteration in the boundary stresses [NJH80]. This fixe...
متن کاملSolving Contact Mechanics Problems with PERMON
PERMON makes use of theoretical results in quadratic programming algorithms and domain decomposition methods. It is built on top of the PETSc framework for numerical computations. This paper describes its fundamental packages and shows their applications. We focus here on contact problems of mechanics decomposed by means of a FETI-type nonoverlapping domain decomposition method. These problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Methods in Applied Mechanics and Engineering
سال: 2012
ISSN: 0045-7825
DOI: 10.1016/j.cma.2011.09.006